Pure strategy equilibria in symmetric two-player zero-sum games

نویسندگان

  • Peter Duersch
  • Jörg Oechssler
  • Burkhard C. Schipper
چکیده

We show that a symmetric two-player zero-sum game has a pure strategy equilibrium if and only if it is not a generalized rock-paper-scissors matrix. Moreover, we show that every finite symmetric quasiconcave two-player zero-sum game has a pure equilibrium. Further sufficient conditions for existence are provided. We point out that the class of symmetric two-player zero-sum games coincides with the class of relative payoff games associated with symmetric two-player games. This allows us to derive results on the existence of finite population evolutionary stable strategies.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pure Saddle Points and Symmetric Relative Payoff Games

It is well known that the rock-paper-scissors game has no pure saddle point. We show that this holds more generally: A symmetric two-player zero-sum game has a pure saddle point if and only if it is not a generalized rock-paper-scissors game. Moreover, we show that every finite symmetric quasiconcave two-player zero-sum game has a pure saddle point. Further sufficient conditions for existence a...

متن کامل

Bounds for Mixed Strategy Equilibria and the Spatial Model of Elections

We prove that the support of mixed strategy equilibria of two-player, symmetric, zero-sum games lies in the uncovered set, a concept originating in the theory of tournaments and the spatial theory of politics. We allow for uncountably in...nite strategy spaces, and, as a special case, we obtain a longstanding claim to the same e¤ect, due to McKelvey (1986), in the political science literature. ...

متن کامل

Finding Equilibria in Games of No Chance

We consider finding maximin strategies and equilibria of explicitly given extensive form games with imperfect information but with no moves of chance. We show: 1. A maximin pure strategy for a two-player extensive form game with perfect recall and no moves of chance can be found in time linear in the size of the game tree. In contrast, it is known that this problem is NP-hard for games with cha...

متن کامل

The Geometry of Nash Equilibria and Correlated Equilibria and a Generalization of Zero-Sum Games

A pure strategy is coherent if it is played with positive probability in at least one correlated equilibrium. A game is pre-tight if in every correlated equilibrium, all incentives constraints for non deviating to a coherent strategy are tight. We show that there exists a Nash equilibrium in the relative interior of the correlated equilibrium polytope if and only if the game is pre-tight. Furth...

متن کامل

On minmax theorems for multiplayer games Citation

We prove a generalization of von Neumann’s minmax theorem to the class of separable multiplayer zerosum games, introduced in [Bregman and Fokin 1998]. These games are polymatrix—that is, graphical games in which every edge is a two-player game between its endpoints—in which every outcome has zero total sum of players’ payoffs. Our generalization of the minmax theorem implies convexity of equili...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Game Theory

دوره 41  شماره 

صفحات  -

تاریخ انتشار 2012